Partitioning signed networks

نویسندگان

  • V. A. Traag
  • P. Doreian
  • A. Mrvar
چکیده

Signed networks appear naturally in contexts where conflict or animosity is apparent. In this book chapter we review some of the literature on signed networks, especially in the context of partitioning. Most of the work is founded in what is known as structural balance theory. We cover the basic mathematical principles of structural balance theory. The theory yields a natural formulation for partitioning. We briefly compare this to other partitioning approaches based on community detection. Finally, we analyse an international network of alliances and conflicts and discuss the implications of our findings for structural balance theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Algorithms for Relaxed Structural Balance Partitioning: Linking Theory, Models, and Data to Understand Social Network Phenomena

Understanding social phenomena with the help of mathematical models requires a coherent combination of theory, models, and data together with using valid data analytic methods. The study of social networks through the use of mathematical models is no exception. The intuitions of structural balance were formalized and led to a pair of remarkable theorems giving the nature of partition structures...

متن کامل

Balanced clusters and diffusion process in signed networks

In this paper we study the topology effects on diffusion process in signed networks. Considering a simple threshold model for diffusion process, it is extended to signed networks and some appropriate definitions are proposed. This model is a basic model that could be extended and applied in analyzing dynamics of many real phenomena such as opinion forming or innovation diffusion in social netwo...

متن کامل

ENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS

 Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...

متن کامل

Partitioning signed social networks

Structural balance theory has proven useful for delineating the blockmodel structure of signed social networks. Even so, most of the observed signed networks are not perfectly balanced. One possibility for this is that in examining the dynamics underlying the generation of signed social networks, insufficient attention has been given to other processes and features of signed networks. These inc...

متن کامل

On spectral partitioning of signed graphs

Classical spectral clustering is based on a spectral decomposition of a graph Laplacian, obtained from a graph adjacency matrix representing positive graph edge weights describing similarities of graph vertices. In signed graphs, the graph edge weights can be negative to describe disparities of graph vertices, for example, negative correlations in the data. Negative weights lead to possible neg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018